A proof of the Shepp-Olkin entropy concavity conjecture

نویسندگان

  • Erwan Hillion
  • Oliver Johnson
چکیده

We prove the Shepp–Olkin conjecture, which states that the entropy of the sum of independent Bernoulli random variables is concave in the parameters of the individual random variables. Our proof is a refinement of an argument previously presented by the same authors, which resolved the conjecture in the monotonic case (where all the parameters are simultaneously increasing). In fact, we show that the monotonic case is the worst case, using a careful analysis of concavity properties of the derivatives of the probability mass function. We propose a generalization of Shepp and Olkin’s original conjecture, to consider Rényi and Tsallis entropies. MSC2000: primary; 60E15, secondary; 94A17, 60D99

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete versions of the transport equation and the Shepp--Olkin conjecture

We introduce a framework to consider transport problems for integer-valued random variables. We introduce weighting coefficients which allow us to characterise transport problems in a gradient flow setting, and form the basis of our introduction of a discrete version of the Benamou–Brenier formula. Further, we use these coefficients to state a new form of weighted log-concavity. These results a...

متن کامل

Concavity of entropy along binomial convolutions

Motivated by a generalization of Sturm-Lott-Villani theory to discrete spaces and by a conjecture stated by Shepp and Olkin about the entropy of sums of Bernoulli random variables, we prove the concavity in t of the entropy of the convolution of a probability measure a, which has the law of a sum of independent Bernoulli variables, by the binomial measure of parameters n ≥ 1 and t.

متن کامل

Entropy and thinning of discrete random variables

We describe five types of results concerning information and concentration of discrete random variables, and relationships between them. These results are motivated by their counterparts in the continuous case. The results we consider are information theoretic approaches to Poisson approximation, the maximum entropy property of the Poisson distribution, discrete concentration (Poincaré and loga...

متن کامل

A short proof of the maximum conjecture in CR dimension one

In this paper and by means of the extant results in the Tanaka theory, we present a very short proof in the specific case of CR dimension one for Beloshapka's maximum conjecture. Accordingly, we prove that each totally nondegenerate model of CR dimension one and length >= 3 has rigidity. As a result, we observe that the group of CR automorphisms associated with each of such models contains onl...

متن کامل

A simple proof of the Ahlswede - Csiszár one-bit theorem

1983 931 from the second, let K = AA'. Then AA' is nonnegative definite and IAl*=+4'I < jy&L4'),i = n(l&z:.). (1) i j The implication of the second inequality from the first follows from the fact that every nonnegative definite matrix K can be factored as K = AA'. A typical proof of Hadamard's inequality is by induction (see, for example, Bellman [l]) and involves a determinant decomposition fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1503.01570  شماره 

صفحات  -

تاریخ انتشار 2015